Homogeneous factorisations of complete graphs with edge-transitive factors
نویسندگان
چکیده
A factorisation of a complete graph Kn is a partition of its edges with each part corresponding to a spanning subgraph (not necessarily connected), called a factor. A factorisation is called homogeneous if there are subgroups M <G ≤ Sn such that M is vertex-transitive and fixes each factor setwise, and G permutes the factors transitively. We classify the homogeneous factorisations of Kn for which there are such subgroups G,M with M transitive on the edges of a factor as well as the vertices. We give infinitely many new examples.
منابع مشابه
Homogeneous factorisations of Johnson graphs
For a graph Γ, subgroups M < G 6 Aut(Γ), and an edge partition E of Γ, the pair (Γ, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on Γ and fixes setwise each part of E , while G permutes the parts of E transitively. A classification is given of all homogeneous factorisations of finite Johnson graphs. There are three infinite families and nine sporadic examples.
متن کاملHomogeneous factorisations of complete multipartite graphs
A homogeneous factorisation of a graph is a partition of its arc set such that there exist vertex transitive subgroups M < G 6 Aut(Γ) with M fixing each part of the partition setwise and G preserving the partition and transitively permuting the parts. In this paper we study homogeneous factorisations of complete multipartite graphs such that M acts regularly on vertices. We provide a necessary ...
متن کاملProduct of normal edge-transitive Cayley graphs
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
متن کاملHomogeneous factorisations of graphs and digraphs
A homogeneous factorisation (M,G,Γ,P) is a partition P of the arc set of a digraph Γ such that there exist vertex transitive groups M < G 6 Aut(Γ) such that M fixes each part of P setwise while G acts transitively on P. Homogeneous factorisations of complete graphs have previously been studied by the second and fourth authors, and are a generalisation of vertex-transitive self-complementary dig...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کامل